Algorithms of approximate dynamic programming for hydro scheduling
نویسندگان
چکیده
منابع مشابه
Approximate Dynamic Programming—ii: Algorithms
• Option Pricing. An American option allows us to buy or sell an asset at any time up to a specified time, where we make money when the price goes under or over (respectively) a set strike price. Valuing the option requires finding an optimal policy for determining when to exercise the option. • Playing Games. Computer algorithms have been designed to play backgammon, bridge, chess, and recentl...
متن کاملApproximate Dynamic Programming by Linear Programming for Stochastic Scheduling
In stochastic scheduling, we want to allocate a limited amount of resources to a set of jobs that need to be serviced. Unlike in deterministic scheduling, however, the parameters of the system may be stochastic. For example, the time it takes to process a job may be subject to random fluctuations. Stochastic scheduling problems occur in a variety of practical situations, such as manufacturing, ...
متن کاملEfficient sampling in approximate dynamic programming algorithms
Dynamic Programming (DP) is known to be a standard optimization tool for solving Stochastic Optimal Control (SOC) problems, either over a finite or an infinite horizon of stages. Under very general assumptions, commonly employed numerical algorithms are based on approximations of the cost-to-go functions, by means of suitable parametric models built from a set of sampling points in the d-dimens...
متن کاملSensor Scheduling for Target Tracking Using Approximate Dynamic Programming
To trade off tracking accuracy and interception risk in a multi-sensor multi-target tracking context, we study the sensor-scheduling problem where we aim to assign sensors to observe targets over time. Our problem is formulated as a partially observable Markov decision process, and this formulation is applied to develop a non-myopic sensor-scheduling scheme. We resort to extended Kalman filteri...
متن کاملOptimizing Trading Decisions for Hydro Storage Systems Using Approximate Dual Dynamic Programming
We propose a new approach to optimize operations of hydro storage systems with multiple connected reservoirs which participate in wholesale electricity markets. Our formulation integrates short-term intraday with long-term interday decisions. The intraday problem considers bidding decisions as well as storage operation during the day and is formulated as a stochastic program. The interday probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: E3S Web of Conferences
سال: 2020
ISSN: 2267-1242
DOI: 10.1051/e3sconf/202014401001